Refining the Stern Diatomic Sequence

نویسندگان

  • Richard P. Stanley
  • Herbert S. Wilf
چکیده

We refine the celebrated Stern Diatomic Sequence {b(n)}n≥0, in which b(n) is the number of partitions of n into powers of 2 for which each part has multiplicity 1 or 2, by studying the sequence {b(n, k)}n,k≥0, in which b(n, k) counts the partitions of n into powers of 2 in which exactly k parts have multiplicity 2, the remaining parts being of multiplicity 1. We find closed formulas for the b(n, k) as well as for various of their associated generating functions. Relationships with Lucas polynomials and other number theoretic functions are discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NON-CONVERGING CONTINUED FRACTIONS RELATED TO THE STERN DIATOMIC SEQUENCE by

— This note is essentially an addendum to the recent article of Dilcher and Stolarsky [7] though some results presented here may be of independent interest. We prove the transcendence of some irregular continued fractions which are related to the Stern diatomic sequence. The proofs of our results rest on the so-called Mahler method.

متن کامل

Largest Values for the Stern Sequence

In 1858, Stern introduced an array, later called the diatomic array. The array is formed by taking two values a and b for the first row, and each succeeding row is formed from the previous by inserting c+d between two consecutive terms with values c, d. This array has many interesting properties, such as the largest value in a row of the diatomic array is the (r + 2)-th Fibonacci number, occurr...

متن کامل

A Multidimensional Continued Fraction Generalization of Stern’s Diatomic Sequence

Continued fractions are linked to Stern’s diatomic sequence 0, 1, 1, 2, 1, 3, 2, 3, 1, 4, . . . (given by the recursion relations α2n = αn and α2n+1 = αn + αn+1, where α0 = 0 and α1 = 1), which has long been known. Using a particular multidimensional continued fraction algorithm (the Farey algorithm), we generalize the diatomic sequence to a sequence of numbers that quite naturally can be terme...

متن کامل

Factors and Irreducibility of Generalized Stern Polynomials

We investigate an infinite class of polynomial sequences at(n; z) with integer parameter t 1, which reduce to the well-known Stern (diatomic) sequence when z = 1 and are (0, 1)-polynomials when t 2. These sequences are related to the theory of hyperbinary expansions. The main purpose of this paper is to obtain various irreducibility and factorization results, most of which involve cyclotomic po...

متن کامل

Largest Values of the Stern Sequence, Alternating Binary Expansions and Continuants

We study the largest values of the rth row of Stern’s diatomic array. In particular, we prove some conjectures of Lansing. Our main tool is the connection between the Stern sequence, alternating binary expansions, and continuants. This allows us to reduce the problem of ordering the elements of the Stern sequence to the problem of ordering continuants. We describe an operation that increases th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010